Organic–Inorganic Hybrid Gold Halide Perovskites: Structural Diversity through Cation Size

Crystal structures of a series of organic–inorganic hybrid gold iodide perovskites, formulated as A₂[Au^II₂][Au^IIII₄] [A=methylammonium (MA) ( 1 ) and formamidinium (FA) ( 2 )], A′₂[I₃]_1−x[Au^II₂]_x[Au^IIII₄] [A′=imidazolium (IMD) ( 3 ), guanidinium (GUA) ( 4 ), dimethylammonium (DMA) ( 5 ), pyridinium (PY) ( 6 ), and piperizinium (PIP) ( 7 )], systematically changed depending on the cation size. In addition, triiodide (I₃⁻) ions were partly incorporated into the AuI₂⁻ sites of 3 – 7 , whereas they were not incorporated into those of 1 and 2 . Such a difference comes from the size of the organic cation. Optical absorption spectra showed characteristic intervalence charge-transfer bands from Au^I to Au^III species, and the optical band gap increased as the size of the cation became larger.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

SPECTRUM-PRESERVING ELEMENTARY OPERATORS ON B（X）

1.IntroductionLetXbeaninfinitedimensionalcomplexBanachspaceandB(X)theBanachalgebraofallboundedlinearoperatorsonX.ForTEB(X),a(T),asusual,willdenotethespectrumofT.Let4bealinearmapfromB(X)intoitself.4isspectrum-preservingifa(di(T))=a(T)forallTEB(X);4isspectrum-compressingifa(4(T))ga(T)forallTEB(X).Itisclearthatif4isunital(i.e.,ac(I)=I),thenacisspectrum-preserving(spectrum-compressing)ifandonlyif4preservesinvertibilityinbothdirections(preservesinvertibility),i.e.,4(T)isinvertibleifando…     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

COMPACT COUPLED LINEAR TAPERED LINE BANDPASS FILTER WITH TWO TRANSMISSION ZEROS

A new compact bandpass filter composed of two coupled linear tapered line resonators (LTLRs) is designed. The two resonators are arranged in different layers. The filter has two transmission zeros on both sides of the passband. It has small size and steep response below its passband. It is also shown that this filter has 0.6 dB low insertion loss at the centre frequency and 10.5% 3dB bandwidth. This work was supported by the Development Foundation of Shanghai Educational Committee (217608) and Shanghai Leading Academic Discipline Project (T0102).     

FORMATION OF SINGULARITIES FOR A KIND OF QUASILINEAR NON－STRICTLY HYPERBOLIC SYSTEM

The author gets a blow-up result of C1 solution to the Cauchy problem for a first order quasilinear non-strictly hyperbolic system in one space dimension.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Nonsensitiveness Regions for Threshold Ellipsoids

The problem is to determine nonsensitiveness regions for threshold ellipsoids within a regular mixed linear model.